An Interior-Point Trust-Region-Based Method for Large-Scale Nonnegative Regularization
نویسندگان
چکیده
We present a new method for large-scale nonnegative regularization, based on a quadratically and nonnegatively constrained quadratic problem. Such problems arise for example in the regularization of ill-posed problems in image restoration where, in addition, some of the matrices involved are very ill-conditioned. The method is an interior-point iteration that requires the solution of a large-scale and possibly ill-conditioned parameterized trust-region subproblems at each step. The method uses recently developed techniques for the large-scale trust-region subproblem. We describe the method and present preliminary numerical results on test problems and image restoration problems. AMS classification: Primary: 86A22. Secondary: 65K10, 90C06
منابع مشابه
Large-Scale Optimization Techniques for Nonnegative Image Restorations
We describe an optimization method for large-scale nonnegative regularization. The method is an interiorpoint iteration that requires the solution of a large-scale and possibly ill-conditioned parameterized trust-region subproblem at each step. The method relies on recently developed techniques for the large-scale trust-region subproblem. We present preliminary numerical results on image restor...
متن کاملComputational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
The trust-region subproblem of minimizing a quadratic function subject to a norm constraint arises in the context of trust-region methods in optimization and in the regularization of discrete forms of ill-posed problems, including non-negative regularization by means of interior-point methods. A class of efficient methods and software for solving large-scale trust-region subproblems is based on...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملAn Interior-point Subspace Minimization Method for the Trust-region Step
Abstract. We consider methods for large-scale unconstrained minimization based on finding an approximate minimizer of a quadratic function subject to a two-norm trust-region inequality constraint. The Steihaug-Toint method uses the conjugate-gradient algorithm to minimize the quadratic over a sequence of expanding subspaces until the iterates either converge to an interior point or cross the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001